Enumerative Induction and Lawlikeness
نویسنده
چکیده
The paper is based on ranking theory, a theory of degrees of disbelief (and hence belief). On this basis, it explains enumerative induction, the confirmation of a law by its positive instances, which may indeed take various schemes. It gives a ranking theoretic explication of a possible law or a nomological hypothesis. It proves, then, that such schemes of enumerative induction uniquely correspond to mixtures of such nomological hypotheses. Thus, it shows that de Finetti’s probabilistic representation theorems may be transformed into an account of confirmation of possible laws and that enumerative induction is equivalent to such an account. The paper concludes with some remarks about the apriority of lawfulness or the uniformity of nature.
منابع مشابه
Induction by Enumeration
Induction by enumeration has a clear interpretation within the numerical paradigm of inductive discovery (i.e., the one pioneered by [Gold, 1967]). The concept is less easily interpreted within the first-order paradigm discussed by [Kelly, 1996, Martin & Osherson, 1998], in which the scientist’s data amount to the basic diagram of a structure. We formulate two kinds of enumerative induction tha...
متن کاملA logical Reconstruction of Leonard Bloomfield’s Linguistic Theory
In this work we present a logical reconstruction of Leonard Bloomfield’s theory of structural linguistics. First, the central notions of this theory are analyzed and discussed. In the following section, a reconstruction with the so-called structuralist approach in the philosophy of science is presented. After defining the general framework of Bloomfield’s theory, questions of lawlikeness and th...
متن کاملEXERCISES ( without solutions ) for Chapter 7 ( symmetric functions ) of Enumerative Combinatorics
1. [2] Find the number f (n) of pairs (λ, µ) such that λ ⊢ n and µ covers λ in Young's lattice Y. Express your answer in terms of p(k), the number of partitions of k, for certain values of k. Try to give a direct bijection, avoiding generating functions, recurrence relations, induction, etc.
متن کاملGuessing a Conjecture in Enumerative Combinatorics and Proving It with a Computer Algebra System
We present a theorem-proving experiment performed with a computer algebra system. It proves a conjecture about the general pattern of the generating functions counting rooted maps of given genus. These functions are characterized by a complex non-linear differential system between generating functions of multi-rooted maps. Establishing a pattern for these functions requires a sophisticated indu...
متن کاملTHE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004